Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
نویسندگان
چکیده
منابع مشابه
A stronger structure theorem for excluded topological minors
Grohe and Marx [4] proved that if G does not contain H as a topological minor, then there exist constants g = O(|V (H)|4), D and t depending only on H such that G is a clique sum of graphs that either contain at most t vertices of degree greater than D or almost embed in some surface of genus at most g. We strengthen this result, giving a more precise description of the latter kind of basic gra...
متن کاملKernels for (connected) Dominating Set on graphs with Excluded Topological subgraphs
We give the first linear kernels for the Dominating Set and Connected Dominating Set problems on graphs excluding a fixed graph H as a topological minor. In other words, we prove the existence of polynomial time algorithms that, for a given H-topological-minor-free graph G and a positive integer k, output an H-topologicalminor-free graph G′ on O(k) vertices such that G has a (connected) dominat...
متن کاملLinear kernels for (connected) dominating set on graphs with excluded topological subgraphs
We give the first linear kernels for Dominating Set and Connected Dominating Set problems on graphs excluding a fixed graph H as a topological minor. In other words, we give polynomial time algorithms that, for a given H-topological-minor free graph G and a positive integer k, output an H-topological-minor free graph G′ on O(k) vertices such that G has a (connected) dominating set of size k if ...
متن کاملThe typical structure of graphs without given excluded subgraphs
Let L be a finite family of graphs. We describe the typical structure of L-free graphs, improving our earlier results [2] on the ErdősFrankl-Rödl theorem [6], by proving our earlier conjecture that, for p = p(L) = minL∈L χ(L)− 1, the structure of almost all L-free graphs is very similar to that of a random subgraph of the Turán graph Tn,p. The “similarity” is measured in terms of graph theoreti...
متن کاملSuccessor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs
We show that the model-checking problem for successorinvariant first-order logic is fixed-parameter tractable on graphs with excluded topological subgraphs when parameterised by both the size of the input formula and the size of the exluded topological subgraph. Furthermore, we show that model-checking for order-invariant first-order logic is tractable on coloured posets of bounded width, param...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2015
ISSN: 0097-5397,1095-7111
DOI: 10.1137/120892234